Applications of Graph Theory and Trees in the Cayley Theorem for Calculating the Number of Isomers in Compounds Alkanes
ثبت نشده
چکیده
Cayley's theorem, in principle, can be used in determining the isomers of alkanes lot, which was originally limited to the calculation of the number of isomers of manual calculation, the method of "drawing and counting." Graph structure of the alkane is a tree (the tree). By proving that the alkane is a tree graph of a satisfying E (G) = V (G) with a value of V (G) = 3n + 2 and E (G) = 3n +1, -1. Alkane with the chemical formula CnH2n +2 where each node has degree one or four points, so that the calculations used 4-Cayley. Based on the theorem of Cayley was able to show that many alkane isomers can be determined through the summation of many Bicentered Centered Tree and Tree. Centered Tree is a tree with one center that has a formula C2h (z) = ΣC2h, nz and Bicentered Tree is a tree with exactly two centers (centers are always close together) which has the formula B2h +1 (z) = ΣB 2h+1, nz
منابع مشابه
A Novel Molecular Descriptor Derived from Weighted Line Graph
The Bertz indices, derived by counting the number of connecting edges of line graphs of a molecule were used in deriving the QSPR models for the physicochemical properties of alkanes. The inability of these indices to identify the hetero centre in a chemical compound restricted their applications to hydrocarbons only. In the present work, a novel molecular descriptor has been derived from the w...
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملSOME GRAPH PARAMETERS ON THE COMPOSITE ORDER CAYLEY GRAPH
In this paper, the composite order Cayley graph Cay(G, S) is introduced, where G is a group and S is the set of all composite order elements of G. Some graph parameters such as diameter, girth, clique number, independence number, vertex chromatic number and domination number are calculated for the composite order Cayley graph of some certain groups. Moreover, the planarity of composite order Ca...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کامل